Sandpiles and Dominos

نویسندگان

  • Laura Florescu
  • Daniela Morar
  • David Perkinson
  • Nicholas Salter
  • Tianyuan Xu
چکیده

We consider the subgroup of the abelian sandpile group of the grid graph consisting of configurations of sand that are symmetric with respect to central vertical and horizontal axes. We show that the size of this group is (i) the number of domino tilings of a corresponding weighted rectangular checkerboard; (ii) a product of special values of Chebyshev polynomials; and (iii) a double-product whose factors are sums of squares of values of trigonometric functions. We provide a new derivation of the formula due to Kasteleyn and to Temperley and Fisher for counting the number of domino tilings of a 2m× 2n rectangular checkerboard and a new way of counting the number of domino tilings of a 2m× 2n checkerboard on a Möbius strip.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Behavior of coupled automata.

We study the nature of statistical correlations that develop between systems of interacting self-organized critical automata (sandpiles). Numerical and analytical findings are presented describing the emergence of "synchronization" between sandpiles and the dependency of this synchronization on factors such as variations in coupling strength, toppling rule probabilities, symmetric versus asymme...

متن کامل

On Computing Fixed Points for Generalized Sandpiles

We prove fixed points results for sandpiles starting with arbitrary initial conditions. We give an effective algorithm for computing such fixed points, and we refine it in the particular case of SPM.

متن کامل

A Variational Principle for Domino Tilings

1.1. Description of results. A domino is a 1×2 (or 2×1) rectangle, and a tiling of a region by dominos is a way of covering that region with dominos so that there are no gaps or overlaps. In 1961, Kasteleyn [Ka1] found a formula for the number of domino tilings of an m × n rectangle (with mn even), as shown in Figure 1 for m = n = 68. Temperley and Fisher [TF] used a different method and arrive...

متن کامل

Local Statistics of Lattice Dimers

We show how to compute the probability of any given local configuration in a random tiling of the plane with dominos. That is, we explicitly compute the measures of cylinder sets for the measure of maximal entropy μ on the space of tilings of the plane with dominos. We construct a measure ν on the set of lozenge tilings of the plane, show that its entropy is the topological entropy, and compute...

متن کامل

The Complexity of Domino Tiling Problems

In this paper, we give a combinatorial formalization that describes a wide range of related problems in the theory of tiling derived from the popular game of dominos. We show that determining if a given finite region of the plane can be tiled with a given set of dominos is NP-Complete. The new graph theoretical methods we introduce allow this result to be easily generalized to a variety of simi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2015